An Asymptotic Gilbert - Varshamov Bound for ( T , M , S ) - Nets
نویسنده
چکیده
(t,m, s)-nets are point sets in Euclidean s-space satisfying certain uniformity conditions, for use in numerical integration. They can be equivalently described in terms of ordered orthogonal arrays, a class of finite geometrical structures generalizing orthogonal arrays. This establishes a link between quasi-Monte Carlo methods and coding theory. In the present paper we prove an asymptotic Gilbert-Varshamov bound for linear nets and compare it to the algebraic-geometric net construction.
منابع مشابه
Algebraic geometry codes with complementary duals exceed the asymptotic Gilbert-Varshamov bound
It was shown by Massey that linear complementary dual (LCD for short) codes are asymptotically good. In 2004, Sendrier proved that LCD codes meet the asymptotic Gilbert-Varshamov (GV for short) bound. Until now, the GV bound still remains to be the best asymptotical lower bound for LCD codes. In this paper, we show that an algebraic geometry code over a finite field of even characteristic is eq...
متن کاملA generalisation of the Gilbert-Varshamov bound and its asymptotic evaluation
The Gilbert-Varshamov (GV) lower bound on the maximum cardinality of a q-ary code of length n with minimum Hamming distance at least d can be obtained by application of Turán’s theorem to the graph with vertex set {0, 1, . . . , q − 1}n in which two vertices are joined if and only if their Hamming distance is at least d. We generalize the GV bound by applying Turán’s theorem to the graph with v...
متن کاملSelf-Dual Codes better than the Gilbert-Varshamov bound
We show that every self-orthogonal code over $\mathbb F_q$ of length $n$ can be extended to a self-dual code, if there exists self-dual codes of length $n$. Using a family of Galois towers of algebraic function fields we show that over any nonprime field $\mathbb F_q$, with $q\geq 64$, except possibly $q=125$, there are self-dual codes better than the asymptotic Gilbert--Varshamov bound.
متن کاملA low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
Since the proof in 1982, by Tsfasman Vlăduţ and Zink of the existence of algebraic-geometric (AG) codes with asymptotic performance exceeding the Gilbert–Varshamov (G–V) bound, one of the challenges in coding theory has been to provide explicit constructions for these codes. In a major step forward during 1995–1996, Garcia and Stichtenoth (G–S) provided an explicit description of algebraic curv...
متن کاملAsymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Permutation Codes
Given positive integers n and d, let M(n, d) denote the maximum size of a permutation code of length n and minimum Hamming distance d. The Gilbert-Varshamov bound asserts that M(n, d) > n!/V(n, d−1) where V(n, d) is the volume of a Hamming sphere of radius d in Sn. Recently, Gao, Yang, and Ge showed that this bound can be improved by a factor Ω(log n), when d is fixed and n →∞. Herein, we consi...
متن کامل